Iteration Free Fractal Image Compression For Color Images Using Vector Quantization, Genetic Algorithm And Simulated Annealing
نویسنده
چکیده
This research paper on iteration free fractal image compression for color images using the techniques Vector Quantization, Genetic Algorithm and Simulated Annealing is proposed, for lossy compression, to improve the decoded image quality, compression ratio and reduction in coding time. Fractal coding consists of the representation of image blocks through the contractive transformation coefficients, using the self-similarity concept present in the larger domain blocks. Fractal coding achieves high compression ratio but it consumes more time to compress and decompress an image. Different techniques are available to reduce the time consumption and improve the decoded image reliability. But most of them lead to a bad image quality, or a lower compression ratio. Usage of synthetic codebook for encoding using Fractal does not require iteration at decoding and the coding error is determined immediately at the encoder. The techniques Vector Quantization, Genetic Algorithm and Simulated Annealing are used to determine the best domain block that matches the range blocks. The proposed algorithm has the better performance in terms of image quality, bit rate and coding time for Color images. Only the encoding consumes more time but the decoding is very fast.
منابع مشابه
Genetic Algorithms for Codebook Generation in Vector Quantization
In the present paper we study genetic algorithms for the codebook generation problem of vector quantization. There are two different approaches to the problem: a codebook-based and a partition-based. Both these approaches can be derived from the optimality criteria of GLA. From these, the codebookbased approach is clearly superior to the partition-based approach. The experiments show that a pur...
متن کاملA.r. Nadira Banu Kamal and S. Thamarai Selvi: Enhanced Iteration-free Fractal Image Coding Algorithm with Efficient Search and Storage Space
An enhanced iteration free fractal algorithm is proposed in this research paper to design an efficient domain pool for image compression. The proposed methodology reduces the coding process time, intensive computation tasks and also the memory requirements. The redundancies in the domain pool are reduced by the Linde Buzo Gray (LBG) Algorithm. For each range block, vector features such as mean ...
متن کاملA kernel vector quantization codebook designing for image compression based on simulated annealing into genetic algorithm
To solve premature phenomenon and falling into local optimum of genetic algorithm, the simulated annealing algorithm is introduced to the genetic algorithm and a simulated annealing is presented based on genetic clustering algorithm, a new effective SA, crossover operator and mutation operator proposed for fitting the partition-based chromosome coding. In addition, the Euclidean distance is rep...
متن کاملImage Compression Using Learned Vector Quantization
This paper presents a study and implementation of still image compression using learned vector quantization. Grey scale, still images are compressed by 16:1 and transmitted at 0.5 bits per pixel, while maintaining a peak signal-to-noise ratio of 30 dB. The vector quantization is learned using Kohonen’s self organizing feature map (SOFM). While not only being representative of the training set, ...
متن کاملHybrid Genetic-Simulated Annealing Approach for Fractal Image Compression
In this paper a hybrid technique of Genetic Algorithm and Simulated Annealing (HGASA) is applied for Fractal Image Compression (FIC). With the help of this hybrid evolutionary algorithm effort is made to reduce the search complexity of matching between range block and domain block. The concept of Simulated Annealing (SA) is incorporated into Genetic Algorithm (GA) in order to avoid pre-mature c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015